skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Yang, Lin"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available December 1, 2026
  2. Free, publicly-accessible full text available July 17, 2026
  3. Free, publicly-accessible full text available June 17, 2026
  4. Free, publicly-accessible full text available June 9, 2026
  5. We study the cooperative asynchronous multi-agent multi-armed bandits problem, where each agent's active (arm pulling) decision rounds are asynchronous. That is, in each round, only a subset of agents is active to pull arms, and this subset is unknown and time-varying. We consider two models of multi-agent cooperation, fully distributed and leader-coordinated, and propose algorithms for both models that attain near-optimal regret and communications bounds, both of which are almost as good as their synchronous counterparts. The fully distributed algorithm relies on a novel communication policy consisting of accuracy adaptive and on-demand components, and successive arm elimination for decision-making. For leader-coordinated algorithms, a single leader explores arms and recommends them to other agents (followers) to exploit. As agents' active rounds are unknown, a competent leader must be chosen dynamically. We propose a variant of the Tsallis-INF algorithm with low switches to choose such a leader sequence. Lastly, we report numerical simulations of our new asynchronous algorithms with other known baselines. 
    more » « less
    Free, publicly-accessible full text available March 6, 2026
  6. Abstract We present a pioneering achievement in the high-precision photometric calibration of CMOS-based photometry, by application of the Gaia Blue Photometer or Red Photometer (XP) spectra–based synthetic photometry method to the mini-SiTian array (MST) photometry. Through 79 repeated observations of thef02field on the night, we find good internal consistency in the calibrated MSTGMST-band magnitudes for relatively bright stars, with a precision of about 4 mmag forGMST ∼ 13. Results from more than 30 different nights (over 3100 observations) further confirm this internal consistency, indicating that the 4 mmag precision is stable and achievable over timescales of months. An independent external validation using spectroscopic data from the Large Sky Area Multi-Object Fiber Spectroscopic Telescope DR10 and high-precision photometric data using CCDs from Gaia DR3 reveals a zero-point consistency better than 1 mmag. Our results clearly demonstrate that CMOS photometry is on par with CCD photometry for high-precision results, highlighting the significant capabilities of CMOS cameras in astronomical observations, especially for large-scale telescope survey arrays. 
    more » « less
    Free, publicly-accessible full text available March 19, 2026